منابع مشابه
Long-Range Percolation Mixing Time
We provide an estimate, sharp up to poly-logarithmic factors, of the asymptotically almost sure mixing time of the graph created by long-range percolation on the cycle of length N (Z/NZ). While it is known that the almost sure diameter drops from linear to poly-logarithmic as the exponent s decreases below 2 [4, 9], the almost sure mixing time drops from N only to N (up to poly-logarithmic fact...
متن کاملLong-range percolation in R
Let X be either Z or the points of a Poisson process in R of intensity 1. Given parameters r and p, join each pair of points of X within distance r independently with probability p. This is the simplest case of a ‘spreadout’ percolation model studied by Penrose [6], who showed that, as r → ∞, the average degree of the corresponding random graph at the percolation threshold tends to 1, i.e., the...
متن کاملGraph diameter in long-range percolation
We study the asymptotic growth of the diameter of the graph obtained by adding sparse “long” edges to a square box in Z. We focus on the cases when an edge between x and y is added with probability decaying with their Euclidean distance like |x − y| as |x − y| → ∞. For s ∈ (d, 2d) we show that the graph diameter for a box of side L scales like (logL) where ∆ = log2(2d/s). In other words, the di...
متن کاملLong-range percolation on the hierarchical lattice
We study long-range percolation on the hierarchical lattice of order N , where any edge of length k is present with probability pk = 1 − exp(−β−kα), independently of all other edges. For fixed β, we show that αc(β) (the infimum of those α for which an infinite cluster exists a.s.) is non-trivial if and only if N < β < N. Furthermore, we show uniqueness of the infinite component and continuity o...
متن کاملOn Long Range Percolation With Heavy Tails
Consider independent long range percolation on Z2, where horizontal and vertical edges of length n are open with probability pn. We show that if lim supn→∞ pn > 0, then there exists an integer N such that PN (0 ↔ ∞) > 0, where PN is the truncated measure obtained by taking pN,n = pn for n ≤ N and pN,n = 0 for all n > N .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2008
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548308008948